Broadcasting on Uni-directional Hypercubes and Its Applications
نویسندگان
چکیده
In this paper, we present three kinds of broadcasting tree for the even dimensional uni-directional hypercube (UHC) and its applications (ASCEND/DESCEND algorithms and bitonic sorting). For the n-dimensional UHC, under the constant evaluation model, one of our all-port broadcasting trees has height n + 1, which is optimal. Whereas the best one of our one-port broadcasting trees needs at most 1 3 4 + n steps
منابع مشابه
Uni-directional Alternating Group Graphs
A class of uni-directional Cayley graphs based on alternating groups is proposed in this paper. It is shown that this class of graphs is strongly connected and recursively scalable. The analysis of the shortest distance between any pair of nodes in a graph of this class is also given. Based on the analysis, we develop a polynomial time routing algorithm which yields a path distance at most one ...
متن کاملLimit of Dislocation Density and Ultra-Grain-Refining on Severe Deformation in Iron
It is well-known that severe deformation to metals causes a direct grain refinement of the matrix without special heat-treatments due to the mechanism of dynamic continuous recrystallization (DCR). However, the microstructural revolution during severe deformation is seemed to be different depending on the deformation mode, namely the direction of deformation. In general, multi-directional defor...
متن کاملTime and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented N node hypercubes. First we generalize a technique, introduced in [3], for partial broadcasting and orientation. Using this technique we develop a broadcasting algorithm on unoriented hypercubes that uses only linear number of bits and runs in optimal time. This gives a positive answer to the question raised in [7] whether O(...
متن کاملMulti-Node Broadcasting in Hypercubes and Star Graphs
Technological advances have made building complicated large-scale multicomputer networks possible. The binary hypercube [7] is undoubtedly one of the most popular interconnection networks for parallel processing. Another candidate is the star graph [1], which has been recognized as an attractive alternative to the hypercube. A large number of researches have studied the star graph, focusing on ...
متن کاملEffects of Multi-directionality on Pedestrian Flow Characteristics
In design and analysis, standard references assume the pedestrian flow as unidirectional. In reality however, pedestrian flow is usually bi-directional. The main question pursued in this paper is that whether the main characteristics of pedestrian flow the same under uni- and bi-directional conditions. In order to achieve this goal, effect of bi-directional stream is inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 19 شماره
صفحات -
تاریخ انتشار 2003